SBMCC: A Generic Source-based Congestion Control Algorithm for Reliable Multicast

نویسندگان

  • Neelkanth Natu
  • Priya Rajagopal
  • Shivkumar Kalyanaraman
چکیده

This paper presents a simple, generic source-based end-to-end multicast congestion control (SBMCC) algorithm for reliable multicast transport (RMT) protocols. The algorithm is completely implemented at the source and leverages the reverse control information ow in RMT protocols like PGM or RMTP [13, 43]. Speci cally, it does not introduce any new control tra c or new elds in RMT protocol headers. It addresses the drop-to-zero problem [42] by introducing a robust, adaptive timelter based upon RTT estimates collected by observing NAK tra c. This solution allows it to scale for large multicast groups while being very adaptive to congestion situation changes in any part of the tree. The algorithm is provably friendly to TCP, and competes fairly with TCP for bandwidth. The scheme has minimal control tra c requirements and weak RTT estimation requirements which allows a large deployment space including multi-sender multicast.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GSC: a generic source-based congestion control algorithm for reliable multicast

This paper presents a simple, generic source-based end-to-end multicast congestion control (GSC) algorithm for reliable multicast transport (RMT) protocols. The algorithm is completely implemented at the source and leverages the reverse control information ow in RMT protocols like PGM or RMTP [13,44]. Speci cally, it does not introduce any new control tra c or new elds in RMT protocol headers. ...

متن کامل

A multicast congestion control mechanism for reliable multicast

This paper evaluates a congestion control mechanism for reliable multicast applications that uses a small dynamic set of group members or representatives to provide timely and accurate feedback on behalf of congested subtrees of a multicast distribution tree Our algorithm does not need to compute round trip time RTT from all receivers to the source nor does it require knowledge of group members...

متن کامل

Row/Column-First: A Path-based Multicast Algorithm for 2D Mesh-based Network on Chips

In this paper, we propose a new path-based multicast algorithm that is called Row/Column-First algorithm. The proposed algorithm constructs a set of multicast paths to deliver a multicast message to all multicast destination nodes. The set of multicast paths are all of row-first or column-first subcategories to maximize the multicast performance. The selection of row-first or column-first appro...

متن کامل

Congestion Control Performance of a Reliable Multicast Protocol

This paper evaluates the congestion control performance of Pseudofed, a congestion-controlled, reliable multicast transport protocol for bulk data transfer. Pseudofed’s congestion control mechanism is based on the concept of representatives, a small, dynamic set of multicast group members. By reducing the congestion control problem to a bounded set of receivers, representatives allow the pointt...

متن کامل

A TCP friendly, rate-based mechanism for NACK-oriented reliable multicast congestion control

In this paper, we describe ongoing work in adding congestion control extensions to an existing negative acknowledgement (NACK) oriented reliable multicast protocol. Our previous work adopted and used the concept of a dynamic worst path representative for equation-based rate adaptation at the multicast source and we have further refined this approach and present results here. We present an overv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007